Stationary map coloring
نویسندگان
چکیده
We consider a planar Poisson process and its associated Voronoi map. We show that there is a proper coloring with 6 colors of the map which is a deterministic isometry-equivariant function of the Poisson process. As part of the proof we show that the 6-core of the corresponding Delaunay triangulation is empty. Generalizations, extensions and some open questions are discussed.
منابع مشابه
Club-guessing, stationary reflection, and coloring theorems
We obtain strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. Along the way, we establish new results in club-guessing and in the general theory of ideals.
متن کاملOne-dependent Coloring by Finitary Factors
Holroyd and Liggett recently proved the existence of a stationary 1-dependent 4-coloring of the integers, the first stationary k-dependent q-coloring for any k and q. That proof specifies a consistent family of finite-dimensional distributions, but does not yield a probabilistic construction on the whole integer line. Here we prove that the process can be expressed as a finitary factor of an i....
متن کاملThe Time Adaptive Self Organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کاملFinitely Dependent Coloring
We prove that proper coloring distinguishes between block-factors and finitely dependent stationary processes. A stochastic process is finitely dependent if variables at sufficiently wellseparated locations are independent; it is a block-factor if it can be expressed as a finite-range function of independent variables. The problem of finding non-block-factor finitely dependent processes dates b...
متن کاملSymmetric 1−dependent colorings of the integers
In a recent paper, we constructed a stationary 1−dependent 4−coloring of the integers that is invariant under permutations of the colors. This was the first stationary finitely dependent q−coloring for any q. When the analogous construction is carried out for q > 4 colors, the resulting process is not finitely dependent. We construct here a process that is symmetric in the colors and 1−dependen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009